A Generalized Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles of Complex Types

نویسندگان

  • Dror Sholomon
  • Omid David
  • Nathan S. Netanyahu
چکیده

In this paper we introduce new types of square-piece jigsaw puzzles, where in addition to the unknown location and orientation of each piece, a piece might also need to be flipped. These puzzles, which are associated with a number of real world problems, are considerably harder, from a computational standpoint. Specifically, we present a novel generalized genetic algorithm (GA)based solver that can handle puzzle pieces of unknown location and orientation (Type 2 puzzles) and (twosided) puzzle pieces of unknown location, orientation, and face (Type 4 puzzles). To the best of our knowledge, our solver provides a new state-of-the-art, solving previously attempted puzzles faster and far more accurately, handling puzzle sizes that have never been attempted before, and assembling the newly introduced two-sided puzzles automatically and effectively. This paper also presents, among other results, the most extensive set of experimental results, compiled as of yet, on Type 2 puzzles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles: Final Report

For this project, I implemented the genetic algorithm-based jigsaw puzzle solver described in “A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles” by Sholomon et al [1]. This method involves producing a “child” solution from two “parent” solutions by detecting, extracting, and combining correctly assembled puzzle pieces. The solver developed by the paper’s team is able to accurately...

متن کامل

A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles Supplementary Material

This document provides supplementary material for our paper, ”A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles”. We present here all of the results obtained using our genetic algorithm (GA)-based solver on both public datasets and new large image benchmarks assembled by us. Moreover, we present additional figures, which better illustrate the puzzle solution, in general, and the cr...

متن کامل

LAJANUGEN LOGESWARAN : SOLVING JIGSAW PUZZLES USING PATHS AND CYCLES 1 Solving Jigsaw Puzzles using Paths and Cycles

There has been a growing interest in image jigsaw puzzles with square shaped pieces. A solver takes as input square shaped patches of the same size belonging to an image and attempts to reconstruct the image. The key components of a jigsaw solver are a compatibility metric and an assembly algorithm. A compatibility metric uses the color content of the image patches to identify which pairs of pi...

متن کامل

Solving Multiple Square Jigsaw Puzzles with Missing Piece

Puzzle solving is important in many applications, such as image editing [1], biology [5] and archaeology, to name a few. This work focuses on puzzles with square pieces. The problem is introduced by [2], where a greedy algorithm, as well as a benchmark, are proposed. The algorithm discussed in [8] improves the results by using a particle filter. Pomeranz et al. [6] introduce the first fully-aut...

متن کامل

Solving Jigsaw Puzzles with Linear Programming

We propose a novel Linear Program (LP) based formulation for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the standard NP-hard formulation, that can describe both jigsaws with pieces of unknown position and puzzles of unknown position and orientation. The main contribution and strength of our approach comes from the LP assembly strategy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014